Resonance graphs of catacondensed even ring systems are median
نویسندگان
چکیده
Let G be a planar embedded 2-connected graph. Then the vertices of its resonance graph R(G) are the 1-factors of G, two 1-factors being adjacent whenever their symmetric difference is a bounded face of G. For a class of graphs containing the chemically important catacondensed benzenoid graphs we show that the resonance graphs are median. In particular, if G belongs to this class, R(G) has an isometric embedding into Qf , where f is the number of bounded faces of G.
منابع مشابه
Fibonacci dimension of the resonance graphs of catacondensed benzenoid graphs
The Fibonacci dimension fdim(G) of a graph G was introduced in [1] as the smallest integer d such that G admits an isometric embedding into Γd, the d-dimensional Fibonacci cube. The Fibonacci dimension of the resonance graphs of catacondensed benzenoid systems is studied. This study is inspired by the fact, that the Fibonacci cubes are precisely the resonance graphs of a subclass of the catacon...
متن کاملOn Resonance Graphs of Catacondensed Hexagonal Graphs: Structure, Coding, and Hamilton Path Algorithm
The vertex set of the resonance graph of a hexagonal graph G consists of 1-factors of G, two 1-factors being adjacent whenever their symmetric difference forms the edge set of a hexagon of G. A decomposition theorem for the resonance graphs of catacondensed hexagonal graph is proved. The theorem intrinsically uses the Cartesian product of graphs. A canonical binary coding of 1-factors of cataco...
متن کاملOn the Fibonacci Dimension of Partial Cubes
The Fibonacci dimension fdim(G) of a graph G was introduced in [7] as the smallest integer d such that G admits an isometric embedding into Qd, the d-dimensional Fibonacci cube. A somewhat new combinatorial characterization of the Fibonacci dimension is given, which enables more comfortable proofs of some previously known results. In the second part of the paper the Fibonacci dimension of the r...
متن کاملA min-max result on catacondensed benzenoid graphs
The resonance graph of a benzenoid graph G has the 1-factors of G as vertices, two 1-factors being adjacent if their symmetric difference forms the edge set of a hexagon of G. It is proved that the smallest number of elementary cuts that cover a catacondensed benzenoid graph equals the dimension of a largest induced hypercube of its resonance graph.
متن کاملON THE REFINEMENT OF THE UNIT AND UNITARY CAYLEY GRAPHS OF RINGS
Let $R$ be a ring (not necessarily commutative) with nonzero identity. We define $Gamma(R)$ to be the graph with vertex set $R$ in which two distinct vertices $x$ and $y$ are adjacent if and only if there exist unit elements $u,v$ of $R$ such that $x+uyv$ is a unit of $R$. In this paper, basic properties of $Gamma(R)$ are studied. We investigate connectivity and the girth of $Gamma(R)$, where $...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Mathematics
دوره 253 شماره
صفحات -
تاریخ انتشار 2002